Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics

نویسندگان

  • Marcelo Finger
  • Mauricio S. C. Hernandes
چکیده

We propose a novel algebraic characterisation of the classical notion of validity in terms of boolean rings, called entailment multipliers. We demonstrate the existence of such multipliers and show how they can be used to derive stronger entailment statements. An interesting property of multipliers lies in their behaviour as invariants in a proof, a fact that is used to show how several inference systems can be employed to compute entailment multipliers. A similar characterisation of validity for modal logics is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logics for Topological Reasoning ESSLLI Summer School August 2000 University of Birmingham, UK

4 The Modal Logic S4 7 4.1 Kripke Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Modal Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Algebraic Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Power-Set Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Mappi...

متن کامل

Relational dual tableaux for interval temporal logics

Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of ...

متن کامل

A modal perspective on defeasible reasoning

We introduce various new supraclassical entailment relations for defeasible reasoning and investigate some of their relationships. The contrapositive of the usual nonmonotonic preferential entailment turns out to be a monotonic supraclassical entailment. Analogously to these two, a nonmonotonic and its contrapositive monotonic supraclassical entailment can be defined by using modal operators re...

متن کامل

The Entailment Problem in Modal and Propositional Dependence Logics

We examine the entailment problem for different modal and propositional dependence logics defined in terms of dependence, independence, or inclusion atoms. We establish numerous new complexity results, and settle a long-standing open question by showing that the validity problem for modal dependence logic is NEXPTIME-complete.

متن کامل

Unified Correspondence as a Proof-Theoretic Tool

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap. These connections have been seminally observed and exploited by Marcus Kracht, in the context of his characterization of the modal axioms (which he calls primitive formulas) which can be effectively transfor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010